Some problems related to bisimilarity on BPP

نویسنده

  • Martin Kot
چکیده

Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. Bisimilarity is studied on various subclasses of BPP as well. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. So far this problem was only known to be PSPACE-hard.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of some Bisimilarity Problems between BPP and BPA or Finite-State System

I present my research concerning complexity of bisimilarity between BPP and other simple process rewrite systems, specifically BPA and finite-state systems. The results are based on some general notions introduced by Jančar in [1] where he has shown PSPACE-completeness of bisimilarity on BPP. Some of presented results are joint work with Zdeněk Sawa or my supervisor Petr Jančar.

متن کامل

Regularity of BPP is PSPACE-complete

Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. But bisimilarity is studied also on various subclasses of BPP. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. This result was presented at winter school Movep’04 in PhD stu...

متن کامل

Decidability Questions for Bismilarity of Petri Nets and Some Related Problems

The main result is undecidability of bisimilarity for labelled (place/transition) Petri nets. The same technique applies to the (preex) language equivalence and reachability set equality, which yields stronger versions with simpler proofs of already known results. The paper also shows decidability of bisimilarity if one of the nets is deterministic up to bisimilarity. Another decidability resul...

متن کامل

On the Complexity of Bisimulation Problems for Basic Parallel Processes

Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has non-elementary complexity [7]. On the other hand, no lower bound for the problem was known. We show that strong bisimilarity of BPP is co-NP-hard. Weak bisimilarity of BPP is not known to be decidable, but an NP lower bound has been shown in [31]. We improve this result by showing that weak bisi...

متن کامل

Notes on Complexity of Bisimilarity between BPA and BPP

We consider the problem of deciding bisimilarity between a BPA process and a BPP process. This problem is known to be decidable, but no complexity bound has been provided so far. Our aim is to clarify the precise complexity and some related questions. In this short submission we present some preliminary results in this direction. In particular we present a necessary and sufficient condition for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004